Some Optimal Codes as Tanner Codes with BCH Component Codes
نویسندگان
چکیده
In this paper we study a class of graph codes with BCH component codes as affine variety codes. We are able to find some optimal binary and ternary codes as Tanner codes with BCH component codes. We choose a special subgraph of the point-line incidence plane of P(2, q) as the Tanner graph, and we are able to describe the codes using Gröbner basis.
منابع مشابه
Parameters of two classes of LCD BCH codes
BCH codes are widely employed in data storage, communications systems, and consumer electronics. A new application of LCD codes in cryptography was found recently. It is known that LCD codes are asymptotically good. LCD cyclic codes were referred to as reversible cyclic codes in the literature. The objective of this paper is to construct a class of LCD codes, which are also BCH codes. The dimen...
متن کاملThe dimension and minimum distance of two classes of primitive BCH codes
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, ...
متن کاملRNN Decoding of Linear Block Codes
Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network architecture can improve on standard belief propagation decoding, despite the large example space. In this paper we introduce a recurrent neural network architecture fo...
متن کاملAnalysis of Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes on the binary erasure channel (BEC) is proposed. The considered GLDPC codes have block linear codes as check nodes. Instead of considering specific check component codes, like Hamming or BCH codes, random codes are considered, and a technique is developed for obtaining the expected check EX...
متن کاملSome Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کامل